Comparing semigroup and monoid presentations for finite monoids
نویسندگان
چکیده
It is known that for any finite group G given by a finite group presentation 〈A |R 〉 there exists a finite semigroup presentation 〈 B | Q 〉 for G of the same deficiency, i.e. satisfying |Q| − |B| = |R| − |A|. It is also known that the analogous statement does not hold for all finite monoids. In this paper we give a necessary and sufficient condition for a finite monoid M , given by a finite monoid presentation, to have a finite semigroup presentation of the same deficiency.
منابع مشابه
Ordered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملOn Kiselman Quotients of 0-hecke Monoids
Combining the definition of 0-Hecke monoids with that of Kiselman semigroups, we define what we call Kiselman quotients of 0-Hecke monoids associated with simply laced Dynkin diagrams. We classify these monoids up to isomorphism, determine their idempotents and show that they are J -trivial. For type A we show that Catalan numbers appear as the maximal cardinality of our monoids, in which case ...
متن کاملAutomatic semigroups vs automaton semigroups
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup, namely the semigroup generated by a Mealy automaton encoding the behaviour of such a language of greedy normal forms under one-sided multiplication. The framework embraces many of the well-known classes of (automatic) semigroups: free semigroups,...
متن کاملOn finitely related semigroups
An algebraic structure is finitely related (has finite degree) if its term functions are determined by some finite set of finitary relations. We show that the following finite semigroups are finitely related: commutative semigroups, 3-nilpotent monoids, regular bands, semigroups with a single idempotent, and Clifford semigroups. Further we provide the first example of a semigroup that is not fi...
متن کاملNew results on the conjecture of Rhodes and on the topological conjecture
Margolis, S.W. and J.E. Pin, New results on the conjecture of Rhodes and on the topological conjecture, Journal of Pure and Applied Algebra 80 (1992) 305-313. The Conjecture of Rhodes, originally called the ‘type II conjecture’ by Rhodes, gives an algorithm to compute the kernel of a finite semigroup. This conjecture has numerous important consequences and is one of the most attractive problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005